On Basic Properties of Jumping Finite Automata
نویسندگان
چکیده
منابع مشابه
On Basic Properties of Jumping Finite Automata
We complete the initial study of jumping finite automata, which was started in a former article of Meduna and Zemek [6]. The open questions about basic closure properties are solved. Besides this, we correct erroneous results presented in the article. Finally, we point out important relations between jumping finite automata and some other models studied in the literature.
متن کاملTwo-dimensional Jumping Finite Automata
In this paper, we extend a newly introduced concept called the jumping finite automata for accepting string languages to two-dimensional jumping finite automata for accepting two-dimensional languages. We discuss some of the basic properties of these automata and compare the family of languages accepted by these automata with the family of Siromoney matrix languages and also recognizable pictur...
متن کاملCharacterization and complexity results on jumping finite automata
In a jumping finite automaton, the input head can jump to an arbitrary position within the remaining input after reading and consuming a symbol. We characterize the corresponding class of languages in terms of special shuffle expressions and survey other equivalent notions from the existing literature. Moreover, we present several results concerning computational hardness and algorithms for par...
متن کاملSelf-modifying Finite Automata | Basic Deenitions and Results Self-modifying Finite Automata | Basic Deenitions and Results
We formally de ne the Self-Modifying Finite Automaton (SMFA), a model of computation introduced in [RS93, RS94, RS95], as a subclass of a new more general model, the Self-Modifying Automaton (SMA). SMAs are similar to standard nite automata, but changes to the transition set are allowed during a computation. An SMFA is constrained in that it can have only nitely many di erent modi cation instru...
متن کاملBasic Properties for Sand Automata
We prove several results about the relations between injectivity and surjectivity for sand automata. Moreover, we begin the exploration of the dynamical behavior of sand automata proving that the property of ultimate periodicity is undecidable. We believe that the proof technique used for this last result might turn out to be useful for many other results in the same context.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Foundations of Computer Science
سال: 2018
ISSN: 0129-0541,1793-6373
DOI: 10.1142/s0129054118500016